Improved Bounds for Smallest Enclosing Disk Range Queries
نویسندگان
چکیده
Let S be a set of n points in the plane. We present a method where, using O(n log n) time and space, S can be pre-processed into a data structure such that given an axis-parallel query rectangle q, we can report the radius of the smallest enclosing disk of the points lying in S ∩ q in O(log n) time per query.
منابع مشابه
Range-Aggregate Queries for Geometric Extent Problems
Let S be a set of n points in the plane. We present data structures that solve range-aggregate query problems on three geometric extent measure problems. Using these data structures, we can report, for any axis-parallel query rectangle Q, the area/perimeter of the convex hull, the width, and the radius of the smallest enclosing disk of the points in S ∩Q.
متن کاملA fast deterministic smallest enclosing disk approximation algorithm
We describe a simple and fast O(n log2 1 ε )-time algorithm for finding a (1 + ε)-approximation of the smallest enclosing disk of a planar set of n points or disks. Experimental results of a readily available implementation are presented. 2004 Elsevier B.V. All rights reserved.
متن کاملSmallest Enclosing Disks (balls and Ellipsoids)
A simple randomized algorithm is developed which computes the smallest enclosing disk of a nite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementat...
متن کاملComputing the Smallest k-Enclosing Circle and Related Problems
We present an e cient algorithm for solving the \smallest k-enclosing circle" ( kSC ) problem: Given a set of n points in the plane and an integer k n, nd the smallest disk containing k of the points. We present two solutions. When using O(nk) storage, the problem can be solved in time O(nk log 2 n). When only O(n logn) storage is allowed, the running time is O(nk log 2 n log n k ). This proble...
متن کاملDisk Constrained 1-Center Queries
We show that a set P of n points in the plane can be preprocessed in O(n log n)-time to construct a data structure supporting O(log n)-time queries of the following form: Find the minimum enclosing circle of P with center on a given disk.
متن کامل